Two-Player Kidney Exchange Game
نویسندگان
چکیده
Kidney exchange programs have been set in several countries within national, regional or hospital frameworks, to increase the possibility of kidney patients being transplanted. For the case of hospital programs, it has been claimed that hospitals would benefit if they collaborated with each other, sharing their internal pools and allowing transplants involving patients of different hospitals. This claim led to the study of multi-hospital exchange markets. We propose a novel direction in this setting by modeling the exchange market as an integer programming game. The analysis of the strategic behavior of the entities participating in the kidney exchange game allowed us to prove that the most rational game outcome maximizes the social welfare and that it can be computed in polynomial time.
منابع مشابه
MAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملInvestigating the Effect of Rewards on Individual Players' Efforts: A Behavioral Approach
The main goal of the study is to examine the effect of rewards on the behavior of players in a team activity. In this framework, by performing 12 sequential and simultaneous games in a laboratory environment examine the rewarding effect on players' behavior. Students from Yazd universities surveyed and the sample of 182 students is in the form of two groups, which collected in total for 2184 ma...
متن کاملThe Game of Blocking Pebbles
Graph Pebbling is a well-studied single-player game on graphs. We introduce the game of blocking pebbles which adapts Graph Pebbling into a two-player strategy game in order to examine it within the context of Combinatorial Game Theory. Positions with game values matching all integers, all nimbers, and many infinitesimals and switches are found.
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملReachability Switching Games
In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. We study zero-, one-, and two-player variants of these games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. In the oneand two-player cases, the...
متن کامل